650 research outputs found

    Color Image Enhancement Based on Ant Colony Optimization Algorithm

    Get PDF
    In the collection, transmission, decoding process, the images are likely to produce noise. Noise makes the image color distorted and the articulation dropped, and also affects the image quality. Due to different causes, there are different types of noise, and the impulse noise is most common among them which exert great influence on the image quality. This paper, according to the characteristics of the color image, combines the ant colony algorithm and weighted vector median filter method to put forward an algorithm for the impulse noise removal and the color image enhancement. This method finds the optimal filter bank parameter by ant colony optimization (ACO) and processes image points polluted by the noise to achieve the purpose of image enhancement and protect the image details and edge information. Simulation experiment proves the correctness and validity of this method

    Multi-Microgrid Collaborative Optimization Scheduling Using an Improved Multi-Agent Soft Actor-Critic Algorithm

    Full text link
    The implementation of a multi-microgrid (MMG) system with multiple renewable energy sources enables the facilitation of electricity trading. To tackle the energy management problem of a MMG system, which consists of multiple renewable energy microgrids belonging to different operating entities, this paper proposes a MMG collaborative optimization scheduling model based on a multi-agent centralized training distributed execution framework. To enhance the generalization ability of dealing with various uncertainties, we also propose an improved multi-agent soft actor-critic (MASAC) algorithm, which facilitates en-ergy transactions between multi-agents in MMG, and employs automated machine learning (AutoML) to optimize the MASAC hyperparameters to further improve the generalization of deep reinforcement learning (DRL). The test results demonstrate that the proposed method successfully achieves power complementarity between different entities, and reduces the MMG system operating cost. Additionally, the proposal significantly outperforms other state-of-the-art reinforcement learning algorithms with better economy and higher calculation efficiency.Comment: Accepted by Energie

    Synthesis of Aminoalkyl Sclareolide Derivatives and Antifungal Activity Studies

    Get PDF
    Sclareolide was developed as an efficient C-nucleophilic reagent for an asymmetric Mannich addition reaction with a series of N-tert-butylsulfinyl aldimines. The Mannich reaction was carried out under mild conditions, affording the corresponding aminoalkyl sclareolide derivatives with up to 98% yield and 98:2:0:0 diastereoselectivity. Furthermore, the reaction could be performed on a gram scale without any reduction in yield and diastereoselectivity. Additionally, deprotection of the obtained Mannich addition products to give the target sclareolide derivatives bearing a free N-H group was demonstrated. In addition, target compounds 4–6 were subjected to an antifungal assay in vitro, which showed considerable antifungal activity against forest pathogenic fungi.Financial support from the National Natural Science Foundation of China (Nos. 21761132021 and 21606133) and IKERBASQUE, Basque Foundation for Science

    Fault Tolerant Free Gait and Footstep Planning for Hexapod Robot Based on Monte-Carlo Tree

    Full text link
    Legged robots can pass through complex field environments by selecting gaits and discrete footholds carefully. Traditional methods plan gait and foothold separately and treat them as the single-step optimal process. However, such processing causes its poor passability in a sparse foothold environment. This paper novelly proposes a coordinative planning method for hexapod robots that regards the planning of gait and foothold as a sequence optimization problem with the consideration of dealing with the harshness of the environment as leg fault. The Monte Carlo tree search algorithm(MCTS) is used to optimize the entire sequence. Two methods, FastMCTS, and SlidingMCTS are proposed to solve some defeats of the standard MCTS applicating in the field of legged robot planning. The proposed planning algorithm combines the fault-tolerant gait method to improve the passability of the algorithm. Finally, compared with other planning methods, experiments on terrains with different densities of footholds and artificially-designed challenging terrain are carried out to verify our methods. All results show that the proposed method dramatically improves the hexapod robot's ability to pass through sparse footholds environment

    Reservoir Characterization during Underbalanced Drilling of Horizontal Wells Based on Real-Time Data Monitoring

    Get PDF
    In this work, a methodology for characterizing reservoir pore pressure and permeability during underbalanced drilling of horizontal wells was presented. The methodology utilizes a transient multiphase wellbore flow model that is extended with a transient well influx analytical model during underbalanced drilling of horizontal wells. The effects of the density behavior of drilling fluid and wellbore heat transfer are considered in our wellbore flow model. Based on Kneissl’s methodology, an improved method with a different testing procedure was used to estimate the reservoir pore pressure by introducing fluctuations in the bottom hole pressure. To acquire timely basic data for reservoir characterization, a dedicated fully automated control real-time data monitoring system was established. The methodology is applied to a realistic case, and the results indicate that the estimated reservoir pore pressure and permeability fit well to the truth values from well test after drilling. The results also show that the real-time data monitoring system is operational and can provide accurate and complete data set in real time for reservoir characterization. The methodology can handle reservoir characterization during underbalanced drilling of horizontal wells

    The Effect of Nonlinear Charging Function and Line Change Constraints on Electric Bus Scheduling

    Get PDF
    The recharging plans are a key component of the electric bus schedule. Since the real-world charging function of electric vehicles follows a nonlinear relationship with the charging duration, it is challenging to accurately estimate the charging time. To provide a feasible bus schedule given the nonlinear charging function, this paper proposes a mixed integer programming model with a piecewise linear charging approximation and multi-depot and multi-vehicle type scheduling. The objective of the model is to minimise the total cost of the schedule, which includes the vehicle purchasing cost and operation cost. From a practical point of view, the number of line changes of each bus is also taken as one of the constraints in the optimisation. An improved heuristic algorithm is then proposed to find high-quality solutions of the problem with an efficient computation. Finally, a real-world dataset is used for the case study. The results of using different charging functions indicate a large deviation between the linear charging function and the piecewise linear approximation, which can effectively avoid the infeasible bus schedules. Moreover, the experiments show that the proposed line change constraints can be an effective control method for transit operators
    corecore